A Review on Algorithms for Constraint-based Causal Discovery

نویسندگان

  • Kui Yu
  • Jiuyong Li
  • Lin Liu
چکیده

Causal discovery studies the problem of mining causal relationships between variables from data, which is of primary interest in science. During the past decades, significant amount of progresses have been made toward this fundamental data mining paradigm. Recent years, as the availability of abundant large-sized and complex observational data, the constrain-based approaches have gradually attracted a lot of interest and have been widely applied to many diverse real-world problems due to the fast running speed and easy generalizing to the problem of causal insufficiency. In this paper, we aim to review the constraint-based causal discovery algorithms. Firstly, we discuss the learning paradigm of the constraint-based approaches. Secondly and primarily, the state-of-the-art constraint-based casual inference algorithms are surveyed with the detailed analysis. Thirdly, several related open-source software packages and benchmark data repositories are briefly summarized. As a conclusion, some open problems in constraint-based causal discovery are outlined for future research.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Insensitivity of Constraint-Based Causal Discovery Algorithms to Violations of the Assumption of Multivariate Normality

Constraint-based causal discovery algorithms, such as the PC algorithm, rely on conditional independence tests and are otherwise independent of the actual distribution of the data. In case of continuous variables, the most popular conditional independence test used in practice is the partial correlation test, applicable to variables that are multivariate Normal. Many researchers assume multivar...

متن کامل

Discovery of Causal Models that Contain Latent Variables Through Bayesian Scoring of Independence Constraints

Discovering causal structure from observational data in the presence of latent variables remains an active research area. Constraint-based causal discovery algorithms are relatively efficient at discovering such causal models from data using independence tests. Typically, however, they derive and output only one such model. In contrast, Bayesian methods can generate and probabilistically score ...

متن کامل

A Bayesian Approach to Causal Discovery

We examine the Bayesian approach to the discovery of directed acyclic causal models and compare it to the constraint-based approach. Both approaches rely on the Causal Markov assumption, but the two di er signi cantly in theory and practice. An important di erence between the approaches is that the constraint-based approach uses categorical information about conditional-independence constraints...

متن کامل

Learning Neighborhoods of High Confidence in Constraint-Based Causal Discovery

Constraint-based causal discovery algorithms use conditional independence tests to identify the skeleton and invariant orientations of a causal network. Two major disadvantages of constraint-based methods are that (a) they are sensitive to error propagation and (b) the results of the conditional independence tests are binarized by being compared to a hard threshold; thus, the resulting networks...

متن کامل

Measurement Error and Causal Discovery

Algorithms for causal discovery emerged in the early 1990s and have since proliferated [4, 10]. After directed acyclic graphical representations of causal structures (causal graphs) were connected to conditional independence relations (the Causal Markov Condition1 and dseparation2), graphical characterizations of Markov equivalence classes of causal graphs (patterns) soon followed, along with p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1611.03977  شماره 

صفحات  -

تاریخ انتشار 2016